Walking on the Edge and Cosystolic Expansion
نویسندگان
چکیده
Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional simplicial complexes, which are the high dimensional analogues of graphs, calls for the natural generalization of random walks to higher dimensions. In particular, a high order random walk on a 2-dimensional simplicial complex moves at random between neighboring edges of the complex, where two edges are considered neighbors if they share a common triangle. We show that if a regular 2-dimensional simplicial complex is a cosystolic expander and the underlying graph of the complex has a spectral gap larger than 1/2, then the random walk on the edges of the complex converges rapidly to the uniform distribution on the edges.
منابع مشابه
Good Distance Lattices from High Dimensional Expanders
We show a new framework for constructing good distance lattices from high dimensional expanders. For error-correcting codes, which have a similar flavor as lattices, there is a known framework that yields good codes from expanders. However, prior to our work, there has been no framework that yields good distance lattices directly from expanders. Interestingly, we need the notion of high dimensi...
متن کاملEdge Crack Studies in Rotating FGM Disks
This article focused on the stress analysis of an edge crack in a thin hallow rotating functionally graded material (FGM) disk. The disk is assumed to be isotropic with exponentially varying elastic modulus in the radial direction. A comprehensive study is carried out for various combinations of the crack length and orientation with the different gradation of materials. The effect of non-unifor...
متن کاملOn the Pixel Expansion of Hypergraph Access Structures in Visual Cryptography Schemes
In a visual cryptography scheme, a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies, but non-qualified subsets of participants have no information about the secret image. Pixel expansion, which represents the number of subpi...
متن کاملMaximal Independent Sets for the Pixel Expansion of Graph Access Structure
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...
متن کاملNew Expansion for Certain Isomers of Various Classes of Fullerenes
This paper is dedicated to propose an algorithm in order to generate the certain isomers of some well-known fullerene bases. Furthermore, we enlist the bipartite edge frustration correlated with some of symmetrically distinct innite families of fullerenes generated by the oered process.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1606.01844 شماره
صفحات -
تاریخ انتشار 2016